On Radio ( n − 4 ) - chromatic Number of the Path P n

نویسنده

  • Pratima Panigrahi
چکیده

For a path Pn of order n, Chartrand et al. [3] have given an upper bound for radio k-chromatic number when 1 ≤ k ≤ n−1. Liu and Zhu [7] have determined the exact value of radio (n−1)-chromatic number of Pn, namely radio number, rn(Pn), when n ≥ 3. Khennoufa and Togni [5] have given the exact value of radio (n − 2)-chromatic number of Pn, namely antipodal number, ac(Pn), when n ≥ 5. Kola and Panigrahi [6] have given the exact value of radio (n−3)-chromatic number of Pn, namely nearly antipodal number, ac′(Pn), when n ≥ 8. In this paper, we give the exact value of radio (n − 4)-chromatic number of Pn, rcn−4(Pn), when n is odd and n ≥ 11. Consequently, the lower bound of rcn−4(Pn+i), n ≥ 11 and i ≥ 1 is improved. We also improve the upper bound of rcn−4(Pn) when n is even and n ≥ 12.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A 4-COLOR THEOREM FOR SURFACES OF GENUS g

For .f a set of graphs, define the bounded chromatic number Xb(&) (resp. the bounded path chromatic number Xpfë) ) to be the minimum number of colors c for which there exists a constant M such that every graph G € 2? can be vertex c-colored so that all but M vertices of G are properly colored (resp. the length of the longest monochromatic path in G is at most M ). For 3? the set of toroidal gra...

متن کامل

Digital Binary Phase-shift Keyed Signal Detector

We have developed the effective algorithm for detecting digital binary phase-shift keyed signals. This algorithm requires a small number of arithmetic operations over the signal period. It can be relatively easy implemented based on the modern programmable logic devices. It also provides high interference immunity by identifying signal presence when signal-to-noise ratio is much less that its w...

متن کامل

Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...

متن کامل

Effect of low frequency stimulation of perforant path on kindling acquisition and synaptic transmission in the dentate gyrus in rats

Introduction: Previous studies have been shown that low frequency stimulation (LFS) has an inhibitory effect on kindling acquisition. However, the mechanism of this effect has not been completely determined. In the present study, the effect of LFS of the perforant path on seizures induced by rapid perforant path kindling was investigated. Methods: Animals were kindled by electrical stimulatio...

متن کامل

NEARLY ANTIPODAL CHROMATIC NUMBER ac′(Pn) OF THE PATH Pn

Chartrand et al. (2004) have given an upper bound for the nearly antipodal chromatic number ac′(Pn) as (n−2 2 ) +2 for n > 9 and have found the exact value of ac′(Pn) for n = 5, 6, 7, 8. Here we determine the exact values of ac′(Pn) for n > 8. They are 2p − 6p + 8 for n = 2p and 2p − 4p + 6 for n = 2p + 1. The exact value of the radio antipodal number ac(Pn) for the path Pn of order n has been ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010